skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Ho, Meng-Che “Turbo”"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract Given a countable structure, the Scott complexity measures the difficulty of characterizing the structure up to isomorphism. In this paper, we consider the Scott complexity of linear orders. For any limit ordinal , we construct a linear order whose Scott complexity is . This completes the classification of the possible Scott sentence complexities of linear orderings. Previously, there was only one known construction of any structure (of any signature) with Scott complexity , and our construction gives new examples, for example, rigid structures, of this complexity. Moreover, we can construct the linear orders so that not only does have Scott complexity , but there are continuum‐many structures and all such structures also have Scott complexity . In contrast, we demonstrate that there is no structure (of any signature) with Scott complexity that is only ‐equivalent to structures with Scott complexity . Our construction is based on functions that are almost periodic but not periodic, such as those arising from shifts of the ‐adic valuations. 
    more » « less
    Free, publicly-accessible full text available April 1, 2026
  2. In this paper, we answer two questions on the complexities of decision problems of groups, each related to a classical result. First, Miller characterized the complexity of the isomorphism problem for finitely presented groups in 1971. We do the same for the isomorphism problem for recursively presented groups. Second, the fact that every Turing degree appears as the degree of the word problem of a finitely presented group is shown independently by multiple people in the 1960s. We answer the analogous question for degrees of ceers instead of Turing degrees. We show that the set of ceers which are computably equivalent to the word problem of a finitely presented group is [Formula: see text]-complete, which is the maximal possible complexity. 
    more » « less
    Free, publicly-accessible full text available March 1, 2026
  3. Abstract A group is said to have rational growth with respect to a generating set if the growth series is a rational function. It was shown by Parry that certain torus bundle groups of even trace exhibits rational growth. We generalize this result to a class of torus bundle groups with odd trace. 
    more » « less